A short proof for Chen's Alternative Kneser Coloring Lemma
نویسندگان
چکیده
We give a short proof for Chen’s Alternative Kneser Coloring Lemma. This leads to a short proof for the Johnson-Holroyd-Stahl conjecture that Kneser graphs have their circular chromatic numbers equal to their chromatic numbers.
منابع مشابه
Short Proofs of the Kneser-Lovász Coloring Principle
We prove that the propositional translations of the KneserLovász theorem have polynomial size extended Frege proofs and quasipolynomial size Frege proofs. We present a new counting-based combinatorial proof of the Kneser-Lovász theorem that avoids the topological arguments of prior proofs. We introduce a miniaturization of the octahedral Tucker lemma, called the truncated Tucker lemma. The prop...
متن کاملA combinatorial proof for the circular chromatic number of Kneser graphs
Chen [4] confirmed the Johnson-Holroyd-Stahl conjecture that the circular chromatic number of a Kneser graph is equal to its chromatic number. A shorter proof of this result was given by Chang, Liu, and Zhu [3]. Both proofs were based on Fan’s lemma [5] in algebraic topology. In this article we give a further simplified proof of this result. Moreover, by specializing a constructive proof of Fan...
متن کاملThe chromatic number of almost stable Kneser hypergraphs
Let V (n, k, s) be the set of k-subsets S of [n] such that for all i, j ∈ S, we have |i−j| ≥ s We define almost s-stable Kneser hypergraph KG ( [n] k )∼ s-stab to be the r-uniform hypergraph whose vertex set is V (n, k, s) and whose edges are the r-uples of disjoint elements of V (n, k, s). With the help of a Zp-Tucker lemma, we prove that, for p prime and for any n ≥ kp, the chromatic number o...
متن کاملA simple proof of Zariski's Lemma
Our aim in this very short note is to show that the proof of the following well-known fundamental lemma of Zariski follows from an argument similar to the proof of the fact that the rational field $mathbb{Q}$ is not a finitely generated $mathbb{Z}$-algebra.
متن کاملAn alternative proof for the constructive Asymmetric Lovász Local Lemma
We provide an alternative constructive proof of the Asymmetric Lovász Local Lemma. Our proof uses the classic algorithmic framework of Moser and the analysis introduced by Giotis, Kirousis, Psaromiligkos, and Thilikos in " On the algorithmic Lovász Local Lemma and acyclic edge coloring " , combined with the work of Bender and Richmond on the multivariable Lagrange Inversion formula.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 120 شماره
صفحات -
تاریخ انتشار 2013